منابع مشابه
Network analysis of Counter-strike and Starcraft
Network games are becoming increasingly popular, but their traf ic patterns have received little attention from the academic research community. A better understanding of network game t ra f i c can lead t o more effective network architectures and more realistic network simulations. W e gathered t ra f i c traces from live Internet games of Counter-strike and Starcraft, representative games fr...
متن کاملRunning head: FROM COUNTER-STRIKE TO COUNTER-STATEMENT 1 From Counter-Strike to Counter-Statement: Using Burke’s pentad as a tool for analyzing video games
As video games increasingly become an important frame of reference and as they are more and more taken seriously in education and research, there is a growing need for a methodological tool for video game analysis. In this paper, rhetorical theory in general and pentadic analysis in particular are introduced as a useful approach to stimulate a critical approach of video games. A case study is p...
متن کاملProlog-Based Reasoning Layer for Counter-Strike Agents
In this paper it is shown an application of an agent-oriented programming paradigm with a reasoning layer based on a logic programming. The presented solution was used to build bots in Counter-Strike video game. The software architecture for new bots has been presented and benefits were discussed. This article does not discusses all the work in detail, but provides more general idea about resea...
متن کاملThe skillful work of play in Counter-Strike
Games have an increasingly important role in modern contemporary culture. Indeed, the effects of games upon culture, childhood development and social relationships have all gained considerable academic attention. Studies have documented how games support interaction (Brown 2004, Moore 2006), creative player activities (Wright 2002), the development of ‘economies’ (Castronova 2005), friendships ...
متن کاملCounter Strike: Generic Top-Down Join Enumeration for Hypergraphs
Finding the optimal execution order of join operations is a crucial task of today’s cost-based query optimizers. There are two approaches to identify the best plan: bottom-up and top-down join enumeration. But only the top-down approach allows for branchand-bound pruning, which can improve compile time by several orders of magnitude while still preserving optimality. For both optimization strat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: (Re)constituer l’archive
سال: 2016
ISSN: 2104-3272
DOI: 10.7202/1044389ar